First order solutions in conic programming
نویسندگان
چکیده
We study the order of maximizers in linear conic programming (CP) as well as stability issues related to this. We do this by taking a semi-infinite view on conic programs: a linear conic problem can be formulated as a special instance of a linear semi-infinite program (SIP), for which characterizations of the stability of first order maximizers are well-known. However, conic problems are highly special SIPs, and therefore these general SIP-results are not valid for CP. We discuss the differences between CP and general SIP concerning the structure and results for stability of first order maximizers, and we present necessary and sufficient conditions for the stability of first order maximizers in CP.
منابع مشابه
An inexact proximal bundle method with applications to convex conic programming
We present an inexact bundle method for minimizing an unconstrained convex sup-function with an open domain. Under some mild assumptions, we reformulate a convex conic programming problem as such problem in terms of the support function. This method is a first-order method, hence it requires much less computational cost in each iteration than second-order approaches such as interior-point metho...
متن کاملFeasibility study of presenting a dynamic stochastic model based on mixed integer second-order conic programming to solve optimal distribution network reconfiguration in the presence of resources and demand-side management
Nowadays, with the use of devices such as fossil distributed generation and renewable energy resources and energy storage systems that are operated at the level of distribution networks, the problem of optimal reconfiguration has faced major challenges, so any change in the power of this resources can have different results in reconfiguration. Similarly, load changes during the day can lead to ...
متن کاملA New Mathematical Approach based on Conic Quadratic Programming for the Stochastic Time-Cost Tradeoff Problem in Project Management
In this paper, we consider a stochastic Time-Cost Tradeoff Problem (TCTP) in PERT networks for project management, in which all activities are subjected to a linear cost function and assumed to be exponentially distributed. The aim of this problem is to maximize the project completion probability with a pre-known deadline to a predefined probability such that the required additional cost is min...
متن کاملA conic quadratic model for supply chain network design under hub, capacity, delay and lost sale
In this paper, mathematical models are proposed for simultaneously modeling location and inventory control decisions in a four echelon supply chain network considering capacity. The echelons considered in this paper include suppliers, warehouses, hubs and retailers. The aim of the model is to minimize the location, transportation and inventory control costs. Hence, a non-linear mixed integer pr...
متن کاملAn inexact block-decomposition method for extra large-scale conic semidefinite programming
In this paper, we present an inexact block-decomposition (BD) first-order method for solving standard form conic semidefinite programming (SDP) which avoids computations of exact projections onto the manifold defined by the affine constraints and, as a result, is able to handle extra large SDP instances. The method is based on a two-block reformulation of the optimality conditions where the fir...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Meth. of OR
دوره 82 شماره
صفحات -
تاریخ انتشار 2015